Algorithms for computing a primary ideal decomposition without producing intermediate redundant components
نویسندگان
چکیده
منابع مشابه
Algorithms for computing a primary ideal decomposition without producing intermediate redundant components
In Noro (2010) we proposed an algorithm for computing primary ideal decomposition by using the notion of separating ideal and showed that it can efficiently decompose several examples which are hard to decompose by existing algorithms. In particular the number of redundant components produced in the algorithm is zero or very small in many examples, but no theoretical explanation for the efficie...
متن کاملAdjudicators for Diverse-Redundant Components
In fault-tolerant components reaIized using replication, severai alternate results are produce d, from which a single correct result must be derived. This is done by a mechanism, that we call an adjudicator Ca concept more generaI than a voter), which uses as its inputs the individuaI results produced by the replicated subcomponents comprising the redundant component. This paper gives a rigouro...
متن کاملEfficient Data Mining with Evolutionary Algorithms for Cloud Computing Application
With the rapid development of the internet, the amount of information and data which are produced, are extremely massive. Hence, client will be confused with huge amount of data, and it is difficult to understand which ones are useful. Data mining can overcome this problem. While data mining is using on cloud computing, it is reducing time of processing, energy usage and costs. As the speed of ...
متن کاملIDRA (IDeal Resource Allocation): A Tool for Computing Ideal Speedups
Performance studies of actual parallel systems usually tend to concéntrate on the effectiveness of a given implementation. This is often done in the absolute, without quantitave reference to the potential parallelism contained in the programs from the point of view of the execution paradigm. We feel that studying the parallelism inherent to the programs is interesting, as it gives information a...
متن کاملPrimary Decomposition Ii: Primary Components and Linear Growth
We study the following properties about primary decomposition over a Noetherian ring R: (1) For finitely generated modules N ⊆ M and a given subset X = {P1, P2, . . . , Pr} ⊆ Ass(M/N), we define an X-primary component of N ( M to be an intersection Q1 ∩ Q2 ∩ · · · ∩ Qr for some Pi-primary components Qi of N ⊆ M and we study the maximal X-primary components of N ⊆ M ; (2) We give a proof of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2011
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2011.06.001